Biobjective optimization over the efficient set of multiobjective integer programming problem

In this article, an exact method is proposed to optimize two preference functions over the efficient set of a multiobjective integer linear program (MOILP). This kind problems arises whenever associated decision-makers have their respective many solutions. For purpose, we develop branch-and-cut algorithm based on programming, for finding solutions in terms both and MOILP problem, without explicitly enumerating all problem. The branch bound process, strengthened by cuts tests, allows us prune large number nodes tree avoid An illustrative example experimental study are reported.